Pegasus: sound continuous invariant generation
نویسندگان
چکیده
Abstract Continuous invariants are an important component in deductive verification of hybrid and continuous systems. Just like discrete used to reason about correctness systems without having unroll their loops, differential equations solve them. Automatic generation remains one the biggest practical challenges automation formal proofs safety for There at present many disparate methods available generating invariants; however, this wealth diverse techniques presents a number challenges, with different strengths weaknesses. To address some these we develop Pegasus : automatic invariant generator which allows combinations various methods, integrate it KeYmaera X theorem prover We describe architectural aspects integration, comment on its experimental evaluation suite benchmarks.
منابع مشابه
Synthesizing Switching Controllers for Hybrid Systems by Continuous Invariant Generation
We extend a template-based approach for synthesizing switching controllers for semi-algebraic hybrid systems, in which all expressions are polynomials. This is achieved by combining a QE (quantifier elimination)-based method for generating continuous invariants with a qualitative approach for predefining templates. Our synthesis method is relatively complete with regard to a given family of pre...
متن کاملA Method for Invariant Generation for Polynomial Continuous Systems
This paper presents a method for generating semi-algebraic invariants for systems governed by non-linear polynomial ordinary differential equations under semi-algebraic evolution constraints. Based on the notion of discrete abstraction, our method eliminates unsoundness and unnecessary coarseness found in existing approaches for computing abstractions for non-linear continuous systems and is ab...
متن کاملContinuous pose-invariant lipreading
In audio-visual automatic speech recognition (AVASR), no research to date has been conducted into the problem of recognising visual speech whilst the speaker is moving their head. In this paper, we extend our current system to deal with this task, which we entitle continuous pose-invariant lipreading. By developing an AVASR system which can deal with such a scenario, we believe we are making th...
متن کاملInvariant Generation in Vampire
This paper describes a loop invariant generator implemented in the theorem prover Vampire. It is based on the symbol elimination method proposed by two authors of this paper. The generator accepts a program written in a subset of C, finds loops in it, analyses the loops, generates and outputs invariants. It also uses a special consequence removal mode added to Vampire to remove invariants impli...
متن کاملAutomatic Invariant Generation
Program invariants are statements or assertions that are widely used in program analysis and proving correctness of programs. A program invariant can be defined for every program location. Invariants provide properties that hold for every valid program execution, and are crucial in program verification. In this survey, we shall describe some techniques that have been used in the past to generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2021
ISSN: ['1572-8102', '0925-9856']
DOI: https://doi.org/10.1007/s10703-020-00355-z